Majorization and Stochastic Comparison Techniques for Scheduling of Parallel Systems

نویسنده

  • Zhen LIU
چکیده

Stochastic scheduling of parallel systems is a recent research area in computer science as well as in operations research. The problem under consideration in this chapter is the scheduling of parallel computations which are modeled by task graphs in multiprocessor systems. The particularity of this study is that task running times are assumed to be random variables, instead of known constants as in the literature of deterministic scheduling. Our goal here is to illustrate one of the most successful approaches, based on sample path analysis and stochastic comparison techniques, for solving such scheduling problems. Both monoprogrammed and multiprogrammed parallel systems are analyzed. New results are presented for these models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect

This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...

متن کامل

A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

متن کامل

Preservation of Stochastic Orderings of Interdependent Series and Parallel Systems by Componentwise Switching to Exponentiated Models

This paper discusses the preservation of some stochastic orders between two interdependent series and parallel systems when the survival and distribution functions of all components switch to the exponentiated model. For the series systems, the likelihood ratio, hazard rate, usual, aging faster, aging intensity, convex transform, star, superadditive and dispersive orderings, and for the paralle...

متن کامل

Stochastic Comparisons of Series and Parallel Systems with Heterogeneous Extended Generalized Exponential Components

In this paper, we discuss the usual stochastic‎, ‎likelihood ratio, ‎dispersive and convex transform order between two parallel systems with independent heterogeneous extended generalized exponential components. ‎We also establish the usual stochastic order between series systems from two independent heterogeneous extended generalized exponential samples. ‎Finally, ‎we f...

متن کامل

A New Ordering for Stochastic Majorization: Theory and Applications

In this paper, we develop a uniied approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings deened in Marshall and Olkin, by deening a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing determin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007